Air traffic assignment to reduce population noise exposure using activity-based approach

Aircraft noise has been regarded as one of the major environmental issues related to air transport. Many airports have introduced a variety of measures to reduce its impact. Several air traffic assignment strategies have been proposed in order to allocate noise more wisely. Even though each decision regarding the assignment of aircraft to routes should consider population exposure to noise, none of the air traffic assignment strategies has addressed daily migrations of population and number of people exposed to noise. The aim of this research is to develop a mathematical model and a heuristic algorithm that could assign aircraft to departure and arrival routes so that number of people exposed to noise is as low as possible, taking into account temporal and spatial variations in population in an airport’s vicinity. The approach was demonstrated on Belgrade airport to show the benefits of the proposed model. Numerical example showed that population exposure to noise could be reduced significantly by applying the proposed air traffic assignment model. As a consequence of the proposed air traffic assignment, overall fuel consumption increased by less than 1%.     

深度模拟器液压系统仿真研究

介绍了深度模拟器总体结构及工作原理,针对深度模拟器控制系统中PID算法及其相关参数进行了仿真研究。以深度模拟器液压系统为模型,利用AMESim仿真软件工具,对整个液压系统进行了仿真分析并对系统各元器件的参数进行了优化,为深度模拟器的进一步研究提供了理论基础。     

基于完全耦合算法的绕水翼流固耦合特性研究

基于完全耦合算法对绕二维NACA0009水翼流固耦合特性进行了数值模拟研究。采用Theodorsen模型和Munch模型对刚性和弹性水翼的水弹性响应进行了数值计算,分析了流体与结构的相互作用关系,研究了影响结构水弹性响应和流固耦合特性的因素。研究结果表明:考虑了流体黏性的Munch模型与基于势流理论的Theodorsen模型对气动弹性响应的数值计算结果基本一致,而Theodorsen模型由于没有考虑流体黏性在一定程度上低估了结构的水弹性响应。结构的惯性、阻尼和刚度力矩与流体的相应附加载荷均处于同一数量级,故流体与结构的相互作用不可忽略,尤其对于弹性水翼,流体的惯性、附加阻尼作用增大,流固耦合算法的数值稳定性对流固耦合特性的计算结果影响将更大。外部激励频率为非共振频率时,结构的刚度作用是影响水弹性响应的主要因素,外部激励频率为共振频率时,流体的附加阻尼和附加刚度作用减弱,除结构的刚度作用外,流体与结构的惯性作用对水弹性响应和流固耦合特性的影响也较大。     

Flexible feeder transit route design to enhance service accessibility in urban area

To improve the accessibility of transit system in urban areas, this paper presents a flexible feeder transit routing model that can serve irregular‐shaped networks. By integrating the cost efficiency of fixed‐route transit system and the flexibility of demand responsive transit system, the proposed model is capable of letting operating feeder busses temporarily deviate from their current route so as to serve the reported demand locations. With an objective of minimizing total bus travel time, a new operational mode is then proposed to allow busses to serve passengers on both street sides. In addition, when multiple feeder busses are operating in the target service area, the proposed model can provide an optimal plan to locate the nearest one to response to the demands. A three‐stage solution algorithm is also developed to yield meta‐optimal solutions to the problem in a reasonable amount of time by transforming the problem into a traveling salesman problem. Numerical studies have demonstrated the effectiveness of the proposed model as well as the heuristic solution approach. Copyright © 2015 John Wiley & Sons, Ltd.     

Train rescheduling model with train delay and passenger impatience time in urban subway network

This paper considers the train rescheduling problem with train delay in urban subway network. With the objective of minimizing the negative effect of train delay to passengers, which is quantified with a weighted combination of travel time cost and the cost of giving up the planned trips, train rescheduling model is proposed to jointly synchronize both train delay operation constraints and passenger behavior choices. Space–time network is proposed to describe passenger schedule‐based path choices and obtain the shortest travel times. Impatience time is defined to describe the intolerance of passengers to train delay. By comparing the increased travel time due to train delay with the passenger impatience time, a binary variable is defined to represent whether the passenger will give up their planned trips or not. The proposed train rescheduling model is implemented using genetic algorithm, and the model effectiveness is further examined through numerical experiments of real‐world urban subway train timetabling test. Duration effects of the train delay to the optimization results are analyzed. Copyright © 2017 John Wiley & Sons, Ltd.     

Multi-objective re-synchronizing of bus timetable: Model,complexity and solution

This work is originally motived by the re-planning of a bus network timetable. The existing timetable with even headways for the network is generated using line by line timetabling approach without considering the interactions between lines. Decision-makers (i.e., schedulers) intend to synchronize vehicle timetable of lines at transfer nodes to facilitate passenger transfers while being concerned with the impacts of re-designed timetable on the regularity of existing timetable and the accustomed trip plans of passengers. Regarding this situation, we investigate a multi-objective re-synchronizing of bus timetable (MSBT) problem, which is characterized by headway-sensitive passenger demand, uneven headways, service regularity, flexible synchronization and involvement of existing bus timetable. A multi-objective optimization model for the MSBT is proposed to make a trade-off between the total number of passengers benefited by smooth transfers and the maximal deviation from the departure times of the existing timetable. By clarifying the mathematical properties and solution space of the model, we prove that the MSBT problem is NP-hard, and its Pareto-optimal front is non-convex. Therefore, we design a non-dominated sorting genetic (NSGA-II) based algorithm to solve this problem. Numerical experiments show that the designed algorithm, compared with enumeration method, can generate high-quality Pareto solutions within reasonable times. We also find that the timetable allowing larger flexibility of headways can obtain more and better Pareto-optimal solutions, which can provide decision-makers more choice.     

Direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem

This paper proposes simple and direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem. It is only necessary to account for random variables independent of link flows by performing a simple transformation of the perceived link travel time with a normal distribution. At every iteration of a Monte-Carlo simulation procedure, the values of the random variables are sampled based on their probability distributions, and then a regular deterministic user equilibrium assignment is carried out to produce link flows. The link flows produced at each iteration of the Monte-Carlo simulation are averaged to yield the final flow pattern. Two test networks demonstrate that the proposed algorithms and the traditional algorithm (the Method of Successive Averages) produce similar results and that the proposed algorithms can be extended to the computation of the case in which the random error term depends on measured travel time.     

Prioritizing road extension projects with interdependent benefits under time constraint

Since transportation projects are costly and resources are limited, prioritizing or sequencing the projects is imperative. This study was inspired by a client who asked: “I have tens of approved road extension projects, but my financial resources are limited. I cannot construct all the projects simultaneously, so can you help me prioritize my projects?” To address this question, the benefits and costs of all the possible scenarios must be known. However, the impacts (or benefit) of road extension projects are highly interdependent, and in sizable cases cannot be specified thoroughly. We demonstrate that the problem is analogous to the Traveling Salesman Problem (TSP). Dynamic change in travel demand during construction is another aspect of the complexity of the problem. The literature is yet to provide efficient methods for large cases. To this end, we developed a heuristic methodology in which the variation of travel demand during the construction period is considered. We introduce a geometrical objective function for which a solution-finding policy based on “gradient maximization” is developed. To address the projects’ interdependency, a special neural network (NN) model was devised. We developed a search engine hybridized of Ant Colony and Genetic Algorithm to seek a solution to the TSP-like problem on the NN based on gradient maximization. The algorithm was calibrated and applied to real data from the city of Winnipeg, Canada, as well as two cases based on Sioux-Falls. The results were reliable and identification of the optimum solution was achievable within acceptable computational time.     

跨境供应链网络海外仓的鲁棒性选址模型及算法

新经济形态下，全球政治、经济形势瞬息万变，多种人为和自然因素导致商业供应链的生存环境日益严峻. 跨境供应链网络作为典型的时效性和运营环境等都具有极大不确定性的复杂网络，研究其鲁棒性问题具有一定的理论意义和实际应用场景. 首先阐明了跨境供应链网络的内涵，认为海外仓的选址优化是控制网络鲁棒性的重要手段；随后基于最小最大后悔值构建了海外仓的鲁棒性选址模型，利用情景松弛算法对模型进行求解. 算例分析结果证明，所构建的海外仓鲁棒性选址模型及算法适用于跨境供应链网络情景.     

基于改进极限学习机的公交站点 短时客流预测方法

以公交车IC 卡和GPS数据为基础，提出了一种基于改进粒子群算法优化极限学习机(IPSO-ELM)的公交站点短时客流预测模型.依托IC 卡和GPS 数据在站点的特征表现和内在联系，定义了站点间距，并分析了站间距和车辆到总站距离间的联系；提出了公交乘客上车站点确定方法，进而得到公交站点上车客流量；通过分析公交客流数据特征，确定ELM输入参数维度，并采用IPSO 算法找到ELM的最优隐含层节点参数；最后依托广州市19 路公交车客流数据仓库进行了方法验证.结果表明：所用优化后的ELM方法预测误差在10%以内，并与应用广泛的SVM、ARIMA和传统ELM模型进行对比分析，发现改进的ELM方法拥有更高的可靠性和泛化性能.